// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
int st=1960,en=2059;
int dm[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
bool run(int x)
{
	return (x%4==0&&x%100!=0)||(x%400==0);
}
signed main()
{
	int t=1;
//	cin>>t;
	while(t--)
	{
		int a,b,c;
		scanf("%lld/%lld/%lld",&a,&b,&c);
		for(int y=st;y<=en;y++)
		{
			dm[2]=(run(y)?29:28);
			for(int m=1;m<=12;m++)
			{
				for(int d=1;d<=dm[m];d++)
				{
					if((a==y%100&&b==m&&c==d)
					||(a==m&&b==d&&c==y%100)
					||(a==d&&b==m&&c==y%100))
					printf("%lld-%02lld-%02lld\n",y,m,d);
				}
			}
		}
	}
	return 0;
}
